A Catalog-Based Caching Strategy for Structured P2P Systems
نویسندگان
چکیده
Cache attempts to improve performance in P2P systems in three ways: improve response time, availability and load balancing. Despite their benefits, some proposals are very coupled with the application level and cannot be easily implemented in other environments, other use pre-defined structures difficult to maintain, or assume peers are physically homogeneous. So, the search for portable and flexible strategies remains an open problem. In this paper we present a caching strategy for improving response time during a query execution using a catalog with information of neighbors cached items, allowing the interaction between different cache levels. A performance evaluation using grids is provided to verify the improvement achieved.
منابع مشابه
A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملSW-Uinta: A Small-World P2P Overlay Network
In this paper, we propose a new structured P2P overlay network, named SW-Uinta, where employs a non-deterministic caching strategy that allows for polylogarithmic search time while having only a constant cache size. Compared with deterministic caching strategies proposed by previous P2P systems, the non-deterministic caching strategy can reduce communication overhead for maintaining the routing...
متن کاملSelf-configuration protocols for P2P networks
This paper proposes and evaluates different protocols for individual peers to self-configure the P2P overlay networks in various network environments. For smallscale homogeneous networks, an optimizer peer selection protocol is proposed and found to be superior to other peer selection protocols, including random, egoist, altruist and greedy protocols, in terms of network diameter and node eccen...
متن کاملDistributed Cache Indexing for Efficient Subspace Skyline Computation in P2P Networks
Skyline queries play an important role in applications such as multicriteria decision making and user preference systems. Recently, more attention has been paid to the problem of efficient skyline computation in the P2P systems. Due to the high distribution of the P2P networks, the skyline computation incurs too many intermediate results transferred between peers, which consumes mass of the net...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010